TSTP Solution File: CSR129^2 by E---3.1.00
View Problem
- Process Solution
%------------------------------------------------------------------------------
% File : E---3.1.00
% Problem : CSR129^2 : TPTP v8.1.2. Released v4.1.0.
% Transfm : none
% Format : tptp:raw
% Command : run_E %s %d THM
% Computer : n004.cluster.edu
% Model : x86_64 x86_64
% CPU : Intel(R) Xeon(R) CPU E5-2620 v4 2.10GHz
% Memory : 8042.1875MB
% OS : Linux 3.10.0-693.el7.x86_64
% CPULimit : 300s
% WCLimit : 300s
% DateTime : Sat May 4 07:34:34 EDT 2024
% Result : Theorem 0.20s 0.50s
% Output : CNFRefutation 0.20s
% Verified :
% SZS Type : Refutation
% Derivation depth : 7
% Number of leaves : 11
% Syntax : Number of formulae : 30 ( 4 unt; 7 typ; 0 def)
% Number of atoms : 87 ( 0 equ; 0 cnn)
% Maximal formula atoms : 12 ( 3 avg)
% Number of connectives : 281 ( 47 ~; 38 |; 17 &; 177 @)
% ( 0 <=>; 2 =>; 0 <=; 0 <~>)
% Maximal formula depth : 13 ( 6 avg)
% Number of types : 2 ( 0 usr)
% Number of type conns : 17 ( 17 >; 0 *; 0 +; 0 <<)
% Number of symbols : 9 ( 7 usr; 6 con; 0-2 aty)
% Number of variables : 13 ( 0 ^ 11 !; 2 ?; 13 :)
% Comments :
%------------------------------------------------------------------------------
thf(decl_28,type,
holdsDuring_THFTYPE_IiooI: $i > $o > $o ).
thf(decl_37,type,
lBill_THFTYPE_i: $i ).
thf(decl_42,type,
lMary_THFTYPE_i: $i ).
thf(decl_45,type,
lSue_THFTYPE_i: $i ).
thf(decl_52,type,
lYearFn_THFTYPE_IiiI: $i > $i ).
thf(decl_53,type,
likes_THFTYPE_IiioI: $i > $i > $o ).
thf(decl_57,type,
n2009_THFTYPE_i: $i ).
thf(ax_011,axiom,
! [X13: $i,X14: $o] :
( ( holdsDuring_THFTYPE_IiooI @ X13 @ ~ X14 )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X13 @ X14 ) ),
file('/export/starexec/sandbox/tmp/tmp.mmqYxkaP3v/E---3.1_24084.p',ax_011) ).
thf(ax_008,axiom,
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
file('/export/starexec/sandbox/tmp/tmp.mmqYxkaP3v/E---3.1_24084.p',ax_008) ).
thf(con,conjecture,
? [X33: $i > $i > $o] :
( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i )
@ ( ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ) ),
file('/export/starexec/sandbox/tmp/tmp.mmqYxkaP3v/E---3.1_24084.p',con) ).
thf(ax_005,axiom,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ),
file('/export/starexec/sandbox/tmp/tmp.mmqYxkaP3v/E---3.1_24084.p',ax_005) ).
thf(c_0_4,plain,
! [X13: $i,X14: $o] :
( ( ( X14
| ( holdsDuring_THFTYPE_IiooI @ X13 @ $true ) )
& ( ~ X14
| ( holdsDuring_THFTYPE_IiooI @ X13 @ $false ) ) )
=> ~ ( holdsDuring_THFTYPE_IiooI @ X13 @ X14 ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_011])]) ).
thf(c_0_5,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_simplification,[status(thm)],[inference(fool_unroll,[status(thm)],[ax_008])]) ).
thf(c_0_6,negated_conjecture,
~ ? [X33: $i > $i > $o] :
( ( ~ ( ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
& ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[inference(assume_negation,[status(cth)],[con])]) ).
thf(c_0_7,plain,
! [X38: $i,X39: $o] :
( ( X39
| ~ X39
| ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ X39 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ $false )
| ~ X39
| ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ X39 ) )
& ( X39
| ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ X39 ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X38 @ X39 ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_4])])])]) ).
thf(c_0_8,plain,
( ( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_5]) ).
thf(c_0_9,axiom,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fool_unroll,[status(thm)],[ax_005]) ).
thf(c_0_10,negated_conjecture,
! [X37: $i > $i > $o] :
( ( ~ ( X37 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X37 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X37 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X37 @ lSue_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X37 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X37 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( X37 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ( X37 @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) )
& ( ~ ( X37 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X37 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ) ),
inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_6])])])]) ).
thf(c_0_11,plain,
! [X1: $i] :
( ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ $true )
| ~ ( holdsDuring_THFTYPE_IiooI @ X1 @ ~ $true ) ),
inference(cn,[status(thm)],[inference(cn,[status(thm)],[inference(split_conjunct,[status(thm)],[c_0_7])])]) ).
thf(c_0_12,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_13,plain,
( ( ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) )
& ( ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $false ) ) ),
inference(fof_nnf,[status(thm)],[c_0_9]) ).
thf(c_0_14,negated_conjecture,
! [X33: $i > $i > $o] :
( ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ ~ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_15,plain,
( ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_11,c_0_12]) ).
thf(c_0_16,plain,
( ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true )
| ~ ( likes_THFTYPE_IiioI @ lMary_THFTYPE_i @ lBill_THFTYPE_i ) ),
inference(split_conjunct,[status(thm)],[c_0_13]) ).
thf(c_0_17,negated_conjecture,
! [X33: $i > $i > $o] :
( ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ) ),
inference(spm,[status(thm)],[c_0_14,c_0_12]) ).
thf(c_0_18,plain,
( ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i )
| ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_8]) ).
thf(c_0_19,plain,
~ ( likes_THFTYPE_IiioI @ lSue_THFTYPE_i @ lMary_THFTYPE_i ),
inference(csr,[status(thm)],[inference(spm,[status(thm)],[c_0_15,c_0_16]),c_0_17]) ).
thf(c_0_20,negated_conjecture,
! [X33: $i > $i > $o] :
( ~ ( X33 @ lSue_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( X33 @ lMary_THFTYPE_i @ lBill_THFTYPE_i )
| ~ ( holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true ) ),
inference(split_conjunct,[status(thm)],[c_0_10]) ).
thf(c_0_21,plain,
holdsDuring_THFTYPE_IiooI @ ( lYearFn_THFTYPE_IiiI @ n2009_THFTYPE_i ) @ $true,
inference(sr,[status(thm)],[c_0_18,c_0_19]) ).
thf(c_0_22,negated_conjecture,
$false,
inference(flex_resolve,[status(thm)],[inference(cn,[status(thm)],[inference(rw,[status(thm)],[c_0_20,c_0_21])])]),
[proof] ).
%------------------------------------------------------------------------------
%----ORIGINAL SYSTEM OUTPUT
% 0.03/0.13 % Problem : CSR129^2 : TPTP v8.1.2. Released v4.1.0.
% 0.13/0.14 % Command : run_E %s %d THM
% 0.13/0.35 % Computer : n004.cluster.edu
% 0.13/0.35 % Model : x86_64 x86_64
% 0.13/0.35 % CPU : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
% 0.13/0.35 % Memory : 8042.1875MB
% 0.13/0.35 % OS : Linux 3.10.0-693.el7.x86_64
% 0.13/0.35 % CPULimit : 300
% 0.13/0.35 % WCLimit : 300
% 0.13/0.35 % DateTime : Fri May 3 15:16:22 EDT 2024
% 0.20/0.35 % CPUTime :
% 0.20/0.48 Running higher-order theorem proving
% 0.20/0.48 Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=300 /export/starexec/sandbox/tmp/tmp.mmqYxkaP3v/E---3.1_24084.p
% 0.20/0.50 # Version: 3.1.0-ho
% 0.20/0.50 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_unif with 1500s (5) cores
% 0.20/0.50 # Starting sh3l with 300s (1) cores
% 0.20/0.50 # Starting new_ho_6 with 300s (1) cores
% 0.20/0.50 # Starting lpo6_lambda_fix with 300s (1) cores
% 0.20/0.50 # sh3l with pid 24165 completed with status 0
% 0.20/0.50 # Result found by sh3l
% 0.20/0.50 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_unif with 1500s (5) cores
% 0.20/0.50 # Starting sh3l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.20/0.50 # Search class: HGHNF-FFSM11-SSSFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # new_ho_10 with pid 24168 completed with status 0
% 0.20/0.50 # Result found by new_ho_10
% 0.20/0.50 # Preprocessing class: HSLSSMSMSSSNSSA.
% 0.20/0.50 # Scheduled 4 strats onto 8 cores with 300 seconds (2400 total)
% 0.20/0.50 # Starting new_ho_10_unif with 1500s (5) cores
% 0.20/0.50 # Starting sh3l with 300s (1) cores
% 0.20/0.50 # SinE strategy is gf120_gu_RUU_F100_L01000
% 0.20/0.50 # Search class: HGHNF-FFSM11-SSSFFSBN
% 0.20/0.50 # Scheduled 6 strats onto 1 cores with 300 seconds (300 total)
% 0.20/0.50 # Starting new_ho_10 with 163s (1) cores
% 0.20/0.50 # Preprocessing time : 0.002 s
% 0.20/0.50 # Presaturation interreduction done
% 0.20/0.50
% 0.20/0.50 # Proof found!
% 0.20/0.50 # SZS status Theorem
% 0.20/0.50 # SZS output start CNFRefutation
% See solution above
% 0.20/0.50 # Parsed axioms : 112
% 0.20/0.50 # Removed by relevancy pruning/SinE : 104
% 0.20/0.50 # Initial clauses : 22
% 0.20/0.50 # Removed in clause preprocessing : 3
% 0.20/0.50 # Initial clauses in saturation : 19
% 0.20/0.50 # Processed clauses : 39
% 0.20/0.50 # ...of these trivial : 0
% 0.20/0.50 # ...subsumed : 8
% 0.20/0.50 # ...remaining for further processing : 30
% 0.20/0.50 # Other redundant clauses eliminated : 0
% 0.20/0.50 # Clauses deleted for lack of memory : 0
% 0.20/0.50 # Backward-subsumed : 7
% 0.20/0.50 # Backward-rewritten : 4
% 0.20/0.50 # Generated clauses : 23
% 0.20/0.50 # ...of the previous two non-redundant : 23
% 0.20/0.50 # ...aggressively subsumed : 0
% 0.20/0.50 # Contextual simplify-reflections : 1
% 0.20/0.50 # Paramodulations : 22
% 0.20/0.50 # Factorizations : 0
% 0.20/0.50 # NegExts : 0
% 0.20/0.50 # Equation resolutions : 0
% 0.20/0.50 # Disequality decompositions : 0
% 0.20/0.50 # Total rewrite steps : 4
% 0.20/0.50 # ...of those cached : 2
% 0.20/0.50 # Propositional unsat checks : 0
% 0.20/0.50 # Propositional check models : 0
% 0.20/0.50 # Propositional check unsatisfiable : 0
% 0.20/0.50 # Propositional clauses : 0
% 0.20/0.50 # Propositional clauses after purity: 0
% 0.20/0.50 # Propositional unsat core size : 0
% 0.20/0.50 # Propositional preprocessing time : 0.000
% 0.20/0.50 # Propositional encoding time : 0.000
% 0.20/0.50 # Propositional solver time : 0.000
% 0.20/0.50 # Success case prop preproc time : 0.000
% 0.20/0.50 # Success case prop encoding time : 0.000
% 0.20/0.50 # Success case prop solver time : 0.000
% 0.20/0.50 # Current number of processed clauses : 8
% 0.20/0.50 # Positive orientable unit clauses : 2
% 0.20/0.50 # Positive unorientable unit clauses: 0
% 0.20/0.50 # Negative unit clauses : 1
% 0.20/0.50 # Non-unit-clauses : 5
% 0.20/0.50 # Current number of unprocessed clauses: 13
% 0.20/0.50 # ...number of literals in the above : 26
% 0.20/0.50 # Current number of archived formulas : 0
% 0.20/0.50 # Current number of archived clauses : 22
% 0.20/0.50 # Clause-clause subsumption calls (NU) : 17
% 0.20/0.50 # Rec. Clause-clause subsumption calls : 16
% 0.20/0.50 # Non-unit clause-clause subsumptions : 11
% 0.20/0.50 # Unit Clause-clause subsumption calls : 9
% 0.20/0.50 # Rewrite failures with RHS unbound : 0
% 0.20/0.50 # BW rewrite match attempts : 2
% 0.20/0.50 # BW rewrite match successes : 2
% 0.20/0.50 # Condensation attempts : 39
% 0.20/0.50 # Condensation successes : 1
% 0.20/0.50 # Termbank termtop insertions : 2068
% 0.20/0.50 # Search garbage collected termcells : 435
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.005 s
% 0.20/0.50 # System time : 0.003 s
% 0.20/0.50 # Total time : 0.008 s
% 0.20/0.50 # Maximum resident set size: 1940 pages
% 0.20/0.50
% 0.20/0.50 # -------------------------------------------------
% 0.20/0.50 # User time : 0.009 s
% 0.20/0.50 # System time : 0.004 s
% 0.20/0.50 # Total time : 0.013 s
% 0.20/0.50 # Maximum resident set size: 1812 pages
% 0.20/0.50 % E---3.1 exiting
% 0.20/0.51 % E exiting
%------------------------------------------------------------------------------